package com.job.netease;

import java.util.Scanner;

/**
 * @ClassName: test.Netease2
 * @Description:
 * @Author: 12071
 * @Date: 2022/4/16 15:11
 */
public class Netease2 {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        long k = sc.nextLong();
        long x = sc.nextLong();

        if((long)n * (n + 1) / 2 > x || k < n){
            System.out.println("-1");
            return;
        }
        long [] res = new long[n];
        for(int i = 0; i <n;i++){
            res[i] = i+1;
        }
        x -= (long)n * (n + 1) / 2;
        for(int i = n - 1; i >= 0 && x > 0; i--){
            long t = Math.min(x,k - res[i]);
            res[i] += t;
            x -= t;
            k--;
        }
        if(x != 0){
            System.out.println("-1");
            return;
        }
        for(int i = 0; i <n; i++){
            System.out.print(res[i] + " ");
        }
        System.out.println();

    }
}
